Sparsity-Based Recovery of Finite Alphabet Solutions to Underdetermined Linear Systems
نویسندگان
چکیده
منابع مشابه
On Sparse Solutions of Underdetermined Linear Systems
We first explain the research problem of finding the sparse solution of underdetermined linear systems with some applications. Then we explain three different approaches how to solve the sparse solution: the l1 approach, the orthogonal greedy approach, and the lq approach with 0 < q ≤ 1. We mainly survey recent results and present some new or simplified proofs. In particular, we give a good rea...
متن کاملSparse Solutions of Underdetermined Linear Systems
Ourmain goal here is to discuss perspectives of applications based on solving underdetermined systems of linear equations (SLE). This discussion will include interconnection of underdetermined SLE with global problems of Information Theory and with data measuring and representation. The preference will be given to the description of the hypothetic destination point of the undertaken efforts, th...
متن کاملReweighted 1-Minimization for Sparse Solutions to Underdetermined Linear Systems
Numerical experiments have indicated that the reweighted `1-minimization performs exceptionally well in locating sparse solutions of underdetermined linear systems of equations. Thus it is important to carry out a further investigation of this class of methods. In this paper, we point out that reweighted `1-methods are intrinsically associated with the minimization of the so-called merit functi...
متن کاملl1-MINIMIZATION FOR SPARSE SOLUTIONS TO UNDERDETERMINED LINEAR SYSTEMS
Numerical experiments have indicated that the reweighted l1-minimization performs exceptionally well in locating sparse solutions of underdetermined linear systems of equations. We show that reweighted l1-methods are intrinsically associated with the minimization of the so-called merit functions for sparsity, which are essentially concave approximations to the cardinality function. Based on thi...
متن کاملRSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
Recently, the worse-case analysis, probabilistic analysis and empirical justification have been employed to address the fundamental question: When does l1-minimization find the sparsest solution to an underdetermined linear system? In this paper, a deterministic analysis, rooted in the classic linear programming theory, is carried out to further address this question. We first identify a necess...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2015.2399914